Death by degrees.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing graphs by degrees

Let G = (V, E) be a graph and let N(v) = {u : uv ∈ E} be the open neighborhood of a vertex v ∈ V . The degree of v, deg(v) = |N(v)|, equals the number of vertices u that are adjacent to v. By considering the relationships between deg(v) and the degrees deg(u), for every u ∈ N(v), we define 10 types of vertices and study some of their properties.

متن کامل

s-Degrees within e-Degrees

For any enumeration degree a let D a be the set of s-degrees contained in a. We answer an open question of Watson by showing that if a is a nontrivial Σ2-enumeration degree, then D a has no least element. We also show that every countable partial order embeds into D a.

متن کامل

Visual servoing by partitioning degrees of freedom

There are many design factors and choices when mounting a vision system for robot control. Such factors may include the kinematic and dynamic characteristics in the robot’s degrees of freedom (DOF), which determine at what velocities and fields-of-view a camera can achieve. Another factor is that additional motion components (such as pan-tilt units) are often mounted on a robot and introduce sy...

متن کامل

Refining membership degrees obtained from fuzzy C-means by re-fuzzification

Fuzzy C-mean (FCM) is the most well-known and widely-used fuzzy clustering algorithm. However, one of the weaknesses of the FCM is the way it assigns membership degrees to data which is based on the distance to the cluster centers. Unfortunately, the membership degrees are determined without considering the shape and density of the clusters. In this paper, we propose an algorithm which takes th...

متن کامل

I classes, LR degrees and Turing degrees

We say that A ≤LR B if every B-random set is A-random with respect to Martin-Löf randomness. We study this reducibility and its interactions with the Turing reducibility, Π1 classes, hyperimmunity and other recursion theoretic notions. A natural variant of the Turing reducibility from the point of view of Martin-Löf randomness is the LR reducibility which was introduced in [12]. We say that A ≤...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMJ

سال: 1987

ISSN: 0959-8138,1468-5833

DOI: 10.1136/bmj.295.6613.1599